Descriptional complexity of iterated uniform finite-state transducers

We introduce the deterministic computational model of an iterated uniform finite-state transducer ( iufst ). An performs same length-preserving transduction on several left-to-right sweeps. The first sweep acts input string, any other processes output previous one. accepts by halting in accepting state at end a sweep. First, we study constant bounded s. prove their power coincides with class regular languages. show descriptional vs. finite automata, and cost implementing language operations. NL -completeness typical decision problems. Next, analyze non-constant they can accept non-regular languages provided least logarithmic amount sweeps is allowed. exhibit proper hierarchy depending complexity. non-semidecidability problems also addressed.